Title . - Fast Path Ethernet Switching : On - demand Efficient Transparent Bridges for

نویسندگان

  • Guillermo Ibáñez
  • Juan A. Carral
  • Alberto García-Martínez
  • José Manuel Arco
  • Diego Rivera Pinto
  • Arturo Azcorra
  • José M. Arco
  • Diego Rivera
چکیده

Ethernet bridging in campus networks offers advantages like zero configuration, no need of IP addresses administration in subnets, high performance and low costs. But Ethernet bridging does not scale. Current proposals under standardization, like Shortest Path Bridges and Routing Bridges use a link-state routing protocol to compute shortest paths. As a simpler alternative, we propose an evolution of the transparent bridges learning mechanism, that provides loop-free, full infrastructure utilization for campus and datacenter networks. Fast Path Ethernet Switches double use the standard ARP Request and Reply packets to set up fast on-demand paths between hosts when needed. This architecture uses standard Ethernet frame format, is fully transparent to hosts and compatible with 802.1D bridges in core-island mode. A proof of concept has been implemented in Linux. Preliminary simulations in metropolitan and campus newtork topologies show clearly superior to spanning tree and even shortest path routers, at a fraction of the complexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ethernet Fabric Routing (UETS/EFR)

In this paper we shall try to answer a fundamental question: how to build the Next Generation Network without disruption. The TCP/IP protocol stack has performance limits and the transparent bridge paradigm of Ethernets is complex to scale by lack of addressing hierarchy. To provide both full scalability and high performance, a new Ethernet switching architecture named Universal Ethernet Teleco...

متن کامل

All-Path Routing Protocols: Analysis of Scalability and Load Balancing Capabilities for Ethernet Networks

This paper presents a scalability and load balancing study of the All-Path protocols, a family of distributed switching protocols based on path exploration. ARP-Path is the main protocol and it explores every possible path reaching from source to destination by using ARP messages, selecting the lowest latency path. Flow-Path and Bridge-Path are respectively the flow-based and bridge-based versi...

متن کامل

Distributed optical control plane for dynamic lightpath establishment in translucent optical networks based on reachability graph

In transparent optical networks, physical layer impairments (PLIs) incurred by non-ideal optical transmission media accumulate along an optical path, and the overall effect determines the optical feasibility of the lightpaths. In addition, transparent optical networks suffer from inefficient wavelength utilization, as a connection request may be rejected because of non-availability of a common ...

متن کامل

An Efficient Layer 2 Routing Algorithm in a Dual-ring Bridged Network for Smart Grid

In a dual-ring bridged network, an RSTP algorithm bridge may send packets to other bridges inefficiently. An RSTP algorithm has only one spanning tree for data communication. A redundant link in a dual-ring bridged network is wasteful and inefficient. Thus, we propose an algorithm that allocates two spanning trees to two separate rings of the dual-ring using PVST (Per VLAN Spanning Tree). After...

متن کامل

Odyssey: a high-performance clustered video server

Video servers are essential in Video-on-Demand and other multimedia applications. In this paper, we present our high-performance clustered CBR video server, Odyssey. Odyssey is a server connecting PCs with switched Ethernet. It provides efficient support for normal play and interactive browsing functions such as fast-forward and fast-backward. We designed a set of algorithms for scheduling, syn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010